New Variants of Divide & Conquer Method Arisingfrom Block Cyclic Reduction Type FormulationTuomo
نویسندگان
چکیده
The Divide & Conquer fast direct method for solving the Poisson equation in rectangular domains is formulated in the classical block cyclic reduction manner, demonstrating the close relationship between the two approaches. Diierent ways of solving the arising reduced systems are considered. The partial solution approach leads to the standard Divide & Conquer method, while the new variants are obtained by using the matrix rational polynomial factorization technique , including the partial fraction expansions, the FFT{approach, and the FACR{technique. Such techniques have originally been considered in the standard cyclic reduction framework. The equivalence of the partial solution and the partial fraction techniques is shown. The computational cost of the considered variants is O(N log N) operations, except for the FACR{technique, for which it is O(N log log N). The stability estimate for the Divide & Conquer method is constructed, and the stability is demonstrated by numerical experiments.
منابع مشابه
A Parallel Fast Direct Solver for Block Tridiagonal Systemswith
A parallel fast direct solver based on the Divide & Conquer method for linear systems with separable block tridiagonal matrices is considered. Such systems appear, for example, when discretizing the Poisson equation in a rectangular domain using the ve{point nite diierence scheme or the piecewise linear nite elements on a triangulated rectangular mesh. The Divide & Conquer method has the arithm...
متن کاملFree Vibration Analysis of Repetitive Structures using Decomposition, and Divide-Conquer Methods
This paper consists of three sections. In the first section an efficient method is used for decomposition of the canonical matrices associated with repetitive structures. to this end, cylindrical coordinate system, as well as a special numbering scheme were employed. In the second section, divide and conquer method have been used for eigensolution of these structures, where the matrices are in ...
متن کاملDivide and Conquer: A New Parallel Algorithm for the Solution of a Tridiagonal Linear System of Equations
Bondeli, S_, Divide and conquer: a parallel algorithm for the solution of a tridiagonal linear system of equations, Parallel Comput ing 17 (1991) 419-434_ We describe a divide and conquer algorithm which solves linear tridiagonal systems with one right-hand side, especially suited for parallel computers. The algorithm is flexible, permits multiprocessing or a combinat ion of vector and multipro...
متن کاملA Parallel Fast Direct Solver for the Discrete Solution of Separable Elliptic Equations
A parallel fast direct solver based on the Divide & Conquer method is considered for linear systems with separable block tridiagonal matrices. Such systems are obtained, for example, by discretizing the two{dimensional Poisson equation posed on rectangular domains with the continuous piecewise linear nite elements on nonuniform triangulated rectangular meshes. The Divide & Conquer method has th...
متن کاملKnowledge Reduction Based on Divide and Conquer Method in Rough Set Theory
The divide and conquer method is a typical granular computing method using multiple levels of abstraction and granulations. So far, although some achievements based on divided and conquer method in the rough set theory have been acquired, the systematic methods for knowledge reduction based on divide and conquer method are still absent. In this paper, the knowledge reduction approaches based on...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996